Steepest ascent can be exponential in bounded treewidth problems
نویسندگان
چکیده
منابع مشابه
Graphs of Bounded Treewidth Can Be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC [GV06] and further to LogCFL [DTW10]. The computation of canonical forms or a canonical labeling provides more information than isomorphism testing. Whether canonization is in NC or even TC was stated as an open question in [Köb06]. Köbler and Verbitsky [KV08] give a TC canonical labeling al...
متن کاملGraphs of Bounded Treewidth can be Canonized in AC
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC [GV06] and further to LogCFL [DTW10]. The computation of canonical forms or a canonical labeling provides more information than isomorphism testing. Whether canonization is in NC or even TC was stated as an open question in [Köb06]. Köbler and Verbitsky [KV08] give a TC canonical labeling al...
متن کاملSteepest Ascent Tariff Reforms
This paper introduces the concept of a steepest ascent tariff reform for a small open economy. By construction, it is locally optimal in that it yields the highest gain in utility of any feasible tariff reform vector of the same length. Accordingly, it provides a convenient benchmark for the evaluation of the welfare effectiveness of other tariff reform proposals. We develop the properties of t...
متن کاملCounting and Enumeration Problems with Bounded Treewidth
By Courcelle’s Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. This result was extended to counting problems by Arnborg et al. and to enumeration problems by Flum et al. Despite the undisputed importance of these results for proving fixed-parameter tractability, they do not directly yi...
متن کاملSteepest Ascent for Large - Scale Linear Programs
Many structured large-scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise linear, concave function subject to linear constraints. The equivalent problem can, in turn, be solved in a finite number of steps using a steepest ascent algorithm. This principle is applied to block diagonal systems yielding refinements of existing algorithms. An app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2020
ISSN: 0167-6377
DOI: 10.1016/j.orl.2020.02.010